Remarks on the circumcenter of mass
نویسندگان
چکیده
Suppose that to every non-degenerate simplex ∆ ⊂ Rn a ‘center’ C(∆) is assigned so that the following assumptions hold: (i) The map ∆ → C(∆) commutes with similarities and is invariant under the permutations of the vertices of the simplex; (ii) The map ∆ → Vol(∆)C(∆) is polynomial in the coordinates of the vertices of the simplex. Then C(∆) is an affine combination of the center of mass CM(∆) and the circumcenter CC(∆) of the simplex: C(∆) = tCM(∆) + (1− t)CC(∆), where the constant t ∈ R depends on the map ∆ 7→ C(∆) (and does not depend on the simplex ∆). The motivation for this theorem comes from the recent study of the circumcenter of mass of simplicial polytopes by the authors and by A. Akopyan.
منابع مشابه
Some Remarks on the Circumcenter of Mass
In this article, we give new proofs for the existence and basic properties of the circumcenter of mass defined by Adler in 1993 and Tabachnikov and Tsukerman in 2013. We start with definitions. Definition 1 The power of a point x with respect to a sphere ω(o, R) inRd is defined as Pow(ω, x) = ‖ox‖2 − R2. Here o is the center and R is the radius of the sphere ω(o, R). Definition 2 Given a simple...
متن کاملRemarks on the the circumcenter of mass
Given a homogeneous polygonal lamina P , one way to find its center of mass is as follows: triangulate P , assign to each triangle its centroid, taken with the weight equal to the area of the triangle, and find the center of mass of the resulting system of point masses. That the resulting point, CM(P ), does not depend on the triangulation, is a consequence of the Archimedes Lemma: if an object...
متن کاملCircumcenter of Mass and Generalized Euler Line
We define and study a variant of the center of mass of a polygon and, more generally, of a simplicial polytope which we call the Circumcenter of Mass (CCM). The Circumcenter of Mass is an affine combination of the circumcenters of the simplices in a triangulation of a polytope, weighted by their volumes. For an inscribed polytope, CCM coincides with the circumcenter. Our motivation comes from t...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملRemarks on Modern Track Geometry Maintenance
A short survey on modern track maintenance methods is given, concentrating on the developments in recent years. The ongoing refinement of the machinery should be shown as the influence of IT-solutions. On top the economic view to the track infrastructure is briefly demonstrated. Further developments in track hardware solutions must respect the obtained high level of track work mechanization. H...
متن کامل